This paper considers an energy-efficient packet scheduling problem overquasi-static block fading channels. The goal is to minimize the total energyfor transmitting a sequence of data packets under the first-in-first-out ruleand strict delay constraints. Conventionally, such design problem is studiedunder the assumption that the packet transmission rate can be characterized bythe classical Shannon capacity formula, which, however, may provide inaccurateenergy consumption estimation, especially when the code blocklength is finite.In this paper, we formulate a new energy-efficient packet scheduling problem byadopting a recently developed channel capacity formula for finite blocklengthcodes. The newly formulated problem is fundamentally more challenging to solvethan the traditional one because the transmission energy function under the newchannel capacity formula neither can be expressed in closed form nor possessesdesirable monotonicity and convexity in general. We analyze conditions on thecode blocklength for which the transmission energy function is monotonic andconvex. Based on these properties, we develop efficient offline packetscheduling algorithms as well as a rolling-window based online algorithm forreal-time packet scheduling. Simulation results demonstrate not only theefficacy of the proposed algorithms but also the fact that the traditionaldesign using the Shannon capacity formula can considerably underestimate thetransmission energy for reliable communications.
展开▼
